Every Convex Free Basic Semi-algebraic Set Has an Lmi Representation
نویسندگان
چکیده
The (matricial) solution set of a Linear Matrix Inequality (LMI) is a convex non-commutative basic open semi-algebraic set (defined below). The main theorem of this paper is a converse, a result which has implications for both semidefinite programming and systems engineering. A non-commutative basic open semi-algebraic set is defined in terms of a non-commutative `×`-matrix polynomial p(x1 · · · , xg). Such a polynomial is a linear combinations of words in non-commuting free variables {x1, . . . , xg} with coefficients from M`, the ` × ` matrices (for some `). The involution T on words given by sending a concatenation of letters to the same letters, but in the reverse order (for instance (xjx`) T = x`xj), extends naturally to such polynomials and p is itself symmetric if p = p. Let Sn(R) denote the set of g-tuples X = (X1, . . . , Xg) of symmetric n × n matrices. A polynomial can naturally be evaluated on a tuple X ∈ Sn(R) yielding a value p(X) which is an ` × ` block matrix with n×n matrix entries. Evaluation at X is compatible with the involution since p (X) = p(X) and if p is symmetric, then p(X) is a symmetric matrix. Assuming that p(0) is invertible, the invertibility set Dp(n) of a noncommutative symmetric polynomial p in dimension n is the component of 0 of the set {X ∈ Sn(R) : p(X) is invertible}. The invertibility set, Dp, is the sequence of sets (Dp(n)), which is the type of set we call a nc basic open semi-algebraic set. The noncommutative set Dp is called convex if, for each n, Dp(n) is convex. A linear matrix inequality is the special case where p = L is an affine linear symmetric polynomial with L(0) = I. In this case, DL is clearly convex. A set is said to have a Linear Matrix Inequality Representation if it is the set of all solutions to some LMI, that is, it has the form DL for some L. The main theorem says: if p(0) is invertible and Dp is bounded, then Dp has an LMI representation if and only if Dp is convex. Date: January 5, 2010. 1991 Mathematics Subject Classification. 47Axx (Primary). 47A63, 47L07, 47L30, 14P10 (Secondary).
منابع مشابه
Matrix Convex Hulls of Free Semialgebraic Sets
This article resides in the realm of the noncommutative (free) analog of real algebraic geometry – the study of polynomial inequalities and equations over the real numbers – with a focus on matrix convex sets C and their projections Ĉ. A free semialgebraic set which is convex as well as bounded and open can be represented as the solution set of a Linear Matrix Inequality (LMI), a result which s...
متن کاملConvex sets with semidefinite representation
We provide a sufficient condition on a class of compact basic semialgebraic sets K ⊂ R for their convex hull co(K) to have a semidefinite representation (SDr). This SDr is explicitly expressed in terms of the polynomials gj that define K. Examples are provided. We also provide an approximate SDr; that is, for every fixed ! > 0, there is a convex set K! such that co(K) ⊆ K! ⊆ co(K) + !B (where B...
متن کاملProgrammable Antenna Design using Convex Optimization
This work presents an application of convex optimization and algebraic geometry in devising secure, powerefficient, beam-steerable, and on-chip transmission systems for wireless networks. First, we introduce a passively controllable smart (PCS) antenna system that can be programmed to generate different radiation patterns in far field by adjusting its variable passive controller at every signal...
متن کاملMatrix Cubes Parameterized by Eigenvalues
Abstract. An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix cube problems whose constraints are the minimum and maximum eigenvalue function on an affine space of symmetric matrices. An LMI representation is given for the convex set of all feasible instances, and its boundary is studied from the perspective of algebraic geomet...
متن کاملConvexity in SemiAlgebraic Geometry and Polynomial Optimization
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for polynomial optimization simplifies and has finite convergence, a highly desirable feature as convex problems are in principle easier to solve. In addition, if a ba...
متن کامل